Graph-based image segmentation using directional nearest neighbor graph
نویسندگان
چکیده
منابع مشابه
Fast PNN-based Clustering Using K-nearest Neighbor Graph
Search for nearest neighbor is the main source of computation in most clustering algorithms. We propose the use of nearest neighbor graph for reducing the number of candidates. The number of distance calculations per search can be reduced from O(N) to O(k) where N is the number of clusters, and k is the number of neighbors in the graph. We apply the proposed scheme within agglomerative clusteri...
متن کاملFast Approximate Nearest-Neighbor Search with k-Nearest Neighbor Graph
We introduce a new nearest neighbor search algorithm. The algorithm builds a nearest neighbor graph in an offline phase and when queried with a new point, performs hill-climbing starting from a randomly sampled node of the graph. We provide theoretical guarantees for the accuracy and the computational complexity and empirically show the effectiveness of this algorithm.
متن کاملPercolation in the k-nearest neighbor graph
Let P be a Poisson process of intensity one in R2. For a fixed integer k, join every point of P to its k nearest neighbors, creating a directed random geometric graph ~ Gk(R). We prove bounds on the values of k that, almost surely, result in an infinite connected component in ~ Gk(R) for various definitions of “component”. We also give high confidence results for the exact values of k needed. I...
متن کاملNearest Neighbor Search on Large-scale Data Using Skip Graph
Nearest neighbor search is one of the most fundamental queries on massive datasets, and it has extensive applications such as pattern recognition, statistical classification, graph algorithms, Location-Based Services and online recommendations. In this report, we propose a new searchable scheme, which can efficiently and securely enable nearest neighbor search over encrypted data on untrusted n...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Science China Information Sciences
سال: 2012
ISSN: 1674-733X,1869-1919
DOI: 10.1007/s11432-012-4706-4